The 007 Benchmark
نویسندگان
چکیده
The 007 Benchmark represents a comprehensive test of 00DBMS performance. In this paper we describe the benchmark and present performance results from its implementation in three 00DBMS systems. It is our hope that the 007 Benchmark will provide useful insight for end-users evaluating the performance of 00DBMS systems; we also hope that the research community will find that 007 provides a database schema, instance, and workload that is useful for evaluating new techniques and algorithms for OODBMS implementation.
منابع مشابه
Experiencing with 007 Benchmark for Concurrency Control Technique Performance Evaluations
The 007 benchmark provides a comprehensive test of OODB (Object-Oriented Data Base) performance. In this paper, we discuss the problems and the possible suggestions for the 007 Benchmark, based on our experience, in terms of performance evaluation of OODB concurrency control techniques. Our discussions are focused on three access types of OODB concurrency control techniques: conflict among meth...
متن کاملThe duality of option investment strategies for hedge funds
This paper explores the structure of optimal investment strategies using stochastic programming and duality theory in investment portfolios containing options for a hedge fund manager who attempts to beat a benchmark. Explicit optimal conditions for option investments are obtained for several models.
متن کاملTracking error: a multistage portfolio model
We study multistage tracking error problems. Different tracking error measures, commonly used in static models, are discussed as well as some problems which arise when we move from static to dynamic models. We are interested in dynamically replicating a benchmark using only a small subset of assets, considering transaction costs due to rebalancing and introducing a liquidity component in the po...
متن کاملImproved scatter search for the global optimization of computationally expensive dynamic models
A new algorithm for global optimization of costly nonlinear continuous problems is presented in this paper. The algorithm is based on the scatter search metaheuristic, which has recently proved to be efficient for solving combinatorial and nonlinear optimization problems. A kriging-based prediction method has been coupled to the main optimization routine in order to discard the evaluation of so...
متن کاملDynamic priority allocation via restless bandit marginal productivity indices
This paper surveys recent work by the author on the theoretical and algorithmic aspects of restless bandit indexation as well as on its application to a variety of problems involving the dynamic allocation of priority to multiple stochastic projects. The main aim is to present ideas and methods in an accessible form that can be of use to researchers addressing problems of such a kind. Besides b...
متن کامل